Towards a New Algebraic Approach to Graph Transformation. Basic Concepts, Sequentialization and Parallelism: Long Version
نویسندگان
چکیده
This paper presents a new characterization of graph transformation rules for simple digraphs based on boolean matrix algebra. We introduce the concept of coherence, which allows the analysis of potential incompatibilities among rules that take part in a sequence of productions. Concurrency is studied under the interleaving and the explicit parallelism views. For the former, the notion of sequential independence is generalized to arbitrary permutations of rules. For the latter, rule composition is defined, which does not generate intermediate states.
منابع مشابه
Matrix Graph Grammars and Monotone Complex Logics
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGGs) as a purely algebraic approach for the study of graph grammars and graph dynamics, based on the representation of graphs by means of their adjacency matrices. MGGs ...
متن کاملFundamental Theory for Typed Attributed Graph Transformation: Long Version
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresp...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملAlgebraic Transformation of Unary Partial Algebras I: Double-Pushout Approach
The transformation of total graph structures has been studied from the algebraic point of view over more than two decades now, and it has motivated the development of the so-called double-pushout and single-pushout approaches to graph transformation. In this article we extend the double-pushout approach to the algebraic transformation of partial many-sorted unary algebras. Such a generalization...
متن کاملTowards the flexible reuse of model transformations: A formal approach based on graph transformation
Model transformations are the heart and soul of Model Driven Engineering (MDE). However, in order to increase the adoption of MDE by industry, techniques for developing model transformations in the large and raising the quality and productivity in their construction, like reusability, are still needed. In previous works, we developed a reutilization approach for graph transformations based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006